Violation of the isotropic mean free path approximation for overdopedLa2−xSrxCuO4
نویسندگان
چکیده
منابع مشابه
Parity violation, anyon scattering, and the mean field approximation.
Some general features of the scattering of boson-based anyons with an added non-statistical interaction are discussed. Periodicity requirements of the phase shifts are derived, and used to illustrate the danger inherent in separating these phase shifts into the well-known pure Aharanov-Bohm phase shifts, and an additional set which arise due to the interaction. It is proven that the added phase...
متن کاملElectron mean free path in elemental metals
The electron mean free path k and carrier relaxation time s of the twenty most conductive elemental metals are determined by numerical integration over the Fermi surface obtained from first-principles, using constant k or s approximations and wave-vector dependent Fermi velocities vf (k). The average vf deviates considerably from the free-electron prediction, even for elements with spherical Fe...
متن کاملstudy of cohesive devices in the textbook of english for the students of apsychology by rastegarpour
this study investigates the cohesive devices used in the textbook of english for the students of psychology. the research questions and hypotheses in the present study are based on what frequency and distribution of grammatical and lexical cohesive devices are. then, to answer the questions all grammatical and lexical cohesive devices in reading comprehension passages from 6 units of 21units th...
An electrical probe of the phonon mean-free path spectrum
Most studies of the mean-free path accumulation function (MFPAF) rely on optical techniques to probe heat transfer at length scales on the order of the phonon mean-free path. In this paper, we propose and implement a purely electrical probe of the MFPAF that relies on photo-lithographically defined heater-thermometer separation to set the length scale. An important advantage of the proposed tec...
متن کاملApproximation Solutions for Time-Varying Shortest Path Problem
Abstract. Time-varying network optimization problems have tradition-ally been solved by specialized algorithms. These algorithms have NP-complement time complexity. This paper considers the time-varying short-est path problem, in which can be optimally solved in O(T(m + n)) time,where T is a given integer. For this problem with arbitrary waiting times,we propose an approximation algorithm, whic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review B
سال: 2008
ISSN: 1098-0121,1550-235X
DOI: 10.1103/physrevb.77.220502